Efficient Hyperelliptic Arithmetic Using Balanced Representation for Divisors
نویسندگان
چکیده
We discuss arithmetic in the Jacobian of a hyperelliptic curve C of genus g. The traditional approach is to fix a point P∞ ∈ C and represent divisor classes in the form E − d(P∞) where E is effective and 0 ≤ d ≤ g. We propose a different representation which is balanced at infinity. The resulting arithmetic is more efficient than previous approaches when there are 2 points at infinity.
منابع مشابه
Fast computation of Tate pairing on general divisors of genus 3 hyperelliptic curves
For the Tate pairing computation over hyperelliptic curves, there are developments by DuursmaLee and Barreto et al., and those computations are focused on degenerate divisors. As divisors are not degenerate form in general, it is necessary to find algorithms on general divisors for the Tate pairing computation. In this paper, we present two efficient methods for computing the Tate pairing over ...
متن کاملEta Pairing Computation on General Divisors over Hyperelliptic Curves y2 = x7-x+/-1
Recent developments on the Tate or Eta pairing computation over hyperelliptic curves by Duursma–Lee and Barreto et al. have focused on degenerate divisors. We present efficient methods that work for general divisors to compute the Eta paring over divisor class groups of the hyperelliptic curves Hd : y2 = x p−x+d where p is an odd prime. On the curve Hd of genus 3, we provide two efficient metho...
متن کاملEfficient reduction of large divisors on hyperelliptic curves
We present an algorithm for reducing a divisor on a hyperelliptic curve of arbitrary genus over any finite field. Our method is an adaptation of a procedure for reducing ideals in quadratic number fields due to Jacobson, Sawilla and Williams, and shares common elements with both the Cantor and the NUCOMP algorithms for divisor arithmetic. Our technique is especially suitable for the rapid reduc...
متن کاملNovel Efficient Implementations of Hyperelliptic Curve Cryptosystems Using Degenerate Divisors
It has recently been reported that the performance of hyperelliptic curve cryptosystems (HECC) is competitive to that of elliptic curve cryptosystems (ECC). However, it is expected that HECC still can be improved due to their mathematically rich structure. We consider here the application of degenerate divisors of HECC to scalar multiplication. We investigate the operations of the degenerate di...
متن کاملFast arithmetic on hyperelliptic curves via continued fraction expansions
In this paper, we present a new algorithm for computing the reduced sum of two divisors of an arbitrary hyperelliptic curve. Our formulas and algorithms are generalizations of Shanks’s NUCOMP algorithm, which was suggested earlier for composing and reducing positive definite binary quadratic forms. Our formulation of NUCOMP is derived by approximating the irrational continued fraction expansion...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IACR Cryptology ePrint Archive
دوره 2008 شماره
صفحات -
تاریخ انتشار 2008